/**
 *
 * <p>Shortest Paths</p>
 *
 * <p>For unweighted graph, breadth first search is a simple approach to find shortest path from a particular node $u$.
 * This works for both directed and undirected graphs.
 * </p>
 *
 *
 * @author Trung Phan
 *
 */
package net.tp.algo.graph.shortestpath;
